Mean squared error minimization for inverse moment problems
نویسندگان
چکیده
We consider the problem of approximating the unknown density u ∈ L2(Ω, λ) of a measure μ on Ω ⊂ Rn, absolutely continuous with respect to some given reference measure λ, from the only knowledge of finitely many moments of μ. Given d ∈ N and moments of order d, we provide a polynomial pd which minimizes the mean square error ∫ (u− p)2dλ over all polynomials p of degree at most d. If there is no additional requirement, pd is obtained as solution of a linear system. In addition, if pd is expressed in the basis of polynomials that are orthonormal with respect to λ, its vector of coefficients is just the vector of given moments and no computation is needed. Moreover pd → u in L2(Ω, λ) as d → ∞. In general nonnegativity of pd is not guaranteed even though u is nonnegative. However, with this additional nonnegativity requirement one obtains analogous results but computing pd ≥ 0 that minimizes ∫ (u − p)2dλ now requires solving an appropriate semidefinite program. We have tested the approach on some applications arising from the reconstruction of geometrical objects and the approximation of solutions of nonlinear differential equations. In all cases our results are significantly better than those obtained with the maximum entropy technique for estimating u.
منابع مشابه
Uniform Moment Bounds of Fisher’s Information with Applications to Time Series by Ngai
In this paper, a uniform (over some parameter space) moment bound for the inverse of Fisher’s information matrix is established. This result is then applied to develop moment bounds for the normalized least squares estimate in (nonlinear) stochastic regression models. The usefulness of these results is illustrated using time series models. In particular, an asymptotic expression for the mean sq...
متن کاملLearning to solve inverse problems using Wasserstein loss
We propose using the Wasserstein loss for training in inverse problems. In particular, we consider a learned primal-dual reconstruction scheme for ill-posed inverse problems using the Wasserstein distance as loss function in the learning. This is motivated by miss-alignments in training data, which when using standard mean squared error loss could severely degrade reconstruction quality. We pro...
متن کاملSliced Inverse Moment Regression Using Weighted Chi-Squared Tests for Dimension Reduction∗
We propose a new class of dimension reduction methods using the first two inverse moments, called Sliced Inverse Moment Regression (SIMR). We develop corresponding weighted chi-squared tests for the dimension of the regression. Basically, SIMR are linear combinations of Sliced Inverse Regression (SIR) and the method using a new candidate matrix which is designed to recover the entire inverse se...
متن کاملThe Optimal Choice of Moments in Dynamic Panel
Empirical researchers frequently use dynamic panel data models and employ Generalized Method of Moments (GMM) estimators (Hansen, 1982) to estimate model parameters. An important practical problem in the estimation of a dynamic panel data model is the choice of moments as it provides a large number of moment conditions. Even though adding moment conditions leads to efficiency gain according to ...
متن کاملDesigning Optimal Spectral Filters for Inverse Problems
Spectral filtering suppresses the amplification of errors when computing solutions to ill-posed inverse problems; however, selecting good regularization parameters is often expensive. In many applications, data are available from calibration experiments. In this paper, we describe how to use such data to precompute optimal spectral filters. We formulate the problem in an empirical Bayes risk mi...
متن کامل